On finitely generated submonoids of free groups
نویسندگان
چکیده
We prove that the classes of graded monoids, regular monoids and Kleene monoids coincide for submonoids of free groups. We also prove that it is decidable whether or not a finitely generated submonoid of a free group is graded, and solve the homomorphism and isomorphism problems for graded submonoids of free groups. This generalizes earlier results for submonoids of free monoids. MSC: 20E05; 20M05; 20F10; 68Q45; 68Q70
منابع مشابه
A Sufficient Condition for Hanna Neumann Property of Submonoids of a Free Monoid
Using automata-theoretic approach, Giambruno and Restivo have investigated on the intersection of two finitely generated submonoids of the free monoid over a finite alphabet. In particular, they have obtained Hanna Neumann property for a special class of submonoids generated by finite prefix sets. This work continues their work and provides a sufficient condition for Hanna Neumann property for ...
متن کاملRational Codes and Free Profinite Monoids
It is well known that clopen subgroups of finitely generated free profinite groups are again finitely generated free profinite groups. Clopen submonoids of free profinite monoids need not be finitely generated nor free. Margolis, Sapir and Weil proved that the closed submonoid generated by a finite code (which is in fact clopen) is a free profinite monoid generated by that code. In this note we...
متن کاملDistortion functions and the membership problem for submonoids of groups and monoids
The notion of upper distortion for graded submonoids embedded in groups and monoids is introduced. A finitely generated monoid M is graded if every element of M can be written in only finitely many ways in terms of some fixed system of generators. Examples of such monoids are free monoids, Artin monoids, and monoids satisfying certain small cancellation conditions. Whenever such a monoid is emb...
متن کاملAn automata-theoretic approach to the study of the intersection of two submonoids of a free monoid
We investigate the intersection of two finitely generated submonoids of the free monoid on a finite alphabet A. To this purpose, we consider automata that recognize such submonoids and we study the product automata recognizing their intersection. By using automata methods we obtain a new proof of a result of Karhumäki on the characterization of the intersection of two submonoids of rank two, in...
متن کاملPresentations of Finitely Generated Submonoids of Finitely Generated Commutative Monoids
We give an algorithmic method for computing a presentation of any finitely generated submonoid of a finitely generated commutative monoid. We use this method also for calculating the intersection of two congruences on Np and for deciding whether or not a given finitely generated commutative monoid is t-torsion free and/or separative. The last section is devoted to the resolution of some simple ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1712.07746 شماره
صفحات -
تاریخ انتشار 2017